Aggressive priming online: Facebook adverts can prime aggressive cognitions
نویسندگان
چکیده
منابع مشابه
Aggressive priming online: Facebook adverts can prime aggressive cognitions
Through the process of priming, incidental stimuli in our environments can influence our thoughts, feelings and behavior. This may be true of incidental stimuli in online environments, such as adverts on websites. Two experiments (N=325, N=331) showed that the mere presence of advertisements with violent content on a simulated Facebook page induced higher levels of aggression-related cognition ...
متن کاملViolent Video Games Prime Both Aggressive and Positive Cognitions
Previous studies have shown that violent video games prime aggressive thoughts and concepts. Interestingly, positively valenced test stimuli are rarely used in this field, though they might provide useful information on the nature of the emotional response to virtual violence and its associative structure. According to the General Aggression Model (GAM) and its extensions (Carnagey, Anderson, &...
متن کاملProsocial video games and aggressive cognitions 1 Prosocial video games reduce aggressive cognitions
Previous research has shown that playing violent video games increased aggressive tendencies. However, as pointed out by the General Learning Model (GLM) (Buckley & Anderson, 2006), depending on their content, video games do not inevitably increase but may also decrease aggressive responses. Accordingly, the present research tested the hypothesis that playing prosocial video games decreases agg...
متن کاملOnline Passive-Aggressive Algorithms
We present a unified view for online classification, regression, and uniclass problems. This view leads to a single algorithmic framework for the three problems. We prove worst case loss bounds for various algorithms for both the realizable case and the non-realizable case. A conversion of our main online algorithm to the setting of batch learning is also discussed. The end result is new algori...
متن کاملAggressive Online Deadline Scheduling
This paper is concerned with online algorithms for scheduling jobs with deadlines on a single processor. It has been known for long that unless the system is underloaded, no online scheduling algorithm can be 1-competitive, i.e., matching the performance of the optimal offline algorithm. Nevertheless, recent work has revealed that some online algorithms using a moderately faster processor (or e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers in Human Behavior
سال: 2015
ISSN: 0747-5632
DOI: 10.1016/j.chb.2015.01.072